Log-convex sequences and nonzero proximate orders
نویسندگان
چکیده
منابع مشابه
Generalized Increasing Convex and Directionally Convex Orders
In this paper, the componentwise increasing convex order, the upper orthant order, the upper orthant convex order, and the increasing directionally convex order for random vectors are generalized to hierarchical classes of integral stochastic order relations. The elements of the generating classes of functions possess nonnegative partial derivatives up to some given degrees. Some properties of ...
متن کاملStationary-excess operator and convex stochastic orders
The present paper aims to point out how the stationary-excess operator and its iterates transform the s-convex stochastic orders and the associated moment spaces. This allows us to propose a new unified method on constructing s-convex extrema for distributions that are known to be t-monotone. Both discrete and continuous cases are investigated. Several extremal distributions under monotonicity ...
متن کاملLog-balanced combinatorial sequences
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two(or more-) term linear recurrence. It is shown that many combinatorially interesti...
متن کاملSome fixed point theorems and common fixed point theorem in log-convex structure
Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.
متن کاملConvex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2017
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2016.11.069